The toric ideal of a graphic matroid is generated by quadrics
نویسنده
چکیده
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated by quadrics corresponding to single element symmetric exchanges. We give a combinatorial proof of White’s conjecture for graphic matroids.
منابع مشابه
The Toric Ideal of a Matroid of Rank 3 is Generated by Quadrics
White conjectured that the toric ideal associated with the basis of a matroid is generated by quadrics corresponding to symmetric exchanges. We present a combinatorial proof of White’s conjecture for matroids of rank 3 by using a lemma proposed by Blasiak.
متن کاملToric Ideals of Lattice Path Matroids and Polymatroids
We show that the toric ideal of a lattice path polymatroid is generated by quadrics corresponding to symmetric exchanges, and give a monomial order under which these quadrics form a Gröbner basis. We then obtain an analogous result for lattice path matroids.
متن کاملSyzygies, multigraded regularity and toric varieties
Using multigraded Castelnuovo-Mumford regularity, we study the equations defining a projective embedding of a variety X . Given globally generated line bundles B1, . . . , Bl on X and m1, . . . , ml ∈ N, consider the line bundle L := B m1 1 ⊗ · · · ⊗ Bl l . We give conditions on the mi which guarantee that the ideal of X in P(H (X, L)∗) is generated by quadrics and the first p syzygies are line...
متن کاملToric Hyperkähler Varieties
Extending work of Bielawski-Dancer [3] and Konno [12], we develop a theory of toric hyperkähler varieties, which involves toric geometry, matroid theory and convex polyhedra. The framework is a detailed study of semi-projective toric varieties, meaning GIT quotients of affine spaces by torus actions, and specifically, of Lawrence toric varieties, meaning GIT quotients of even-dimensional affine...
متن کاملMonomial and Toric Ideals Associated to Ferrers Graphs
Each partition λ = (λ1, λ2, . . . , λn) determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed a Ferrers ideal, is a squarefree monomial ideal that is generated by quadrics. We show that such an ideal has a 2-linear minimal free resolution; i.e. it defines a small subscheme. In fact, we prove that this property characterizes Ferrers graphs amo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 28 شماره
صفحات -
تاریخ انتشار 2008